-
1 flow algorithm
Большой англо-русский и русско-английский словарь > flow algorithm
-
2 flow algorithm
Математика: потоковый алгоритм -
3 flow algorithm
мат. -
4 maximum flow algorithm
Математика: алгоритм поиска максимального потокаУниверсальный англо-русский словарь > maximum flow algorithm
-
5 minimum cost flow algorithm
Математика: алгоритм поиска потока минимальной стоимостиУниверсальный англо-русский словарь > minimum cost flow algorithm
-
6 minimum cost flow algorithm
English-Russian scientific dictionary > minimum cost flow algorithm
-
7 algorithm
-
8 algorithm
- ad hoc algorithm
- adaptive algorithm
- aim algorithm
- algorithm for path connections
- automatic assessment algorithm
- back-propagation algorithm
- banker's algorithm
- best-route algorithm
- bicomponent algorithm
- bipartitioning algorithm
- bisection algorithm
- branch-bound algorithm
- branching algorithm
- cascading algorithm
- chain algorithm
- channel router algorithm
- coarse-to-fine algorithm
- column sweep algorithm
- combinatorial algorithm
- computational algorithm
- computing algorithm
- conservative algorithm
- control algorithm
- convergent algorithm
- curve-fitting algorithm
- cutting-plane algorithm
- D-algorithm
- decision algorithm
- decoding algorithm
- demand-paging algorithm
- deterministic algorithm
- digit-by-digit algorithm
- divide-and-conquer algorithm
- double-sweep algorithm
- draphics algorithm
- drawing algorithm
- DSP algorithm
- dual algorithm
- durable algorithm
- earliest-deadline-first algorithm
- edge-based algorithm
- event-scheduling algorithm
- exchange algorithm
- fault-handling algorithm
- fine-to-coarse algorithm
- fixed-stealing algorithm
- fixed-step-size algorithm
- flow-synthesis algorithm
- forward-looking algorithm
- generalized algorithm
- genetic algorithm
- Goto algorithm
- graph algorithm
- graph traversal algorithm
- greedy algorithm
- grid expansion algorithm
- hardware algorithm
- heuristic algorithm
- Hightower algorithm
- incorrect algorithm
- inference-based algorithm
- inferencing algorithm
- instruction issue algorithm
- integer algorithm
- integrated query optimization algorithm
- iteration algorithm
- iterative algorithm
- layout algorithm
- layout copmaction algorithm
- leaky bucket algorithm
- learning algorithm
- least frequently used algorithm
- least recently used algorithm
- Lee-expansion algorithm
- Lee-type algorithm
- levelization algorithm
- linear expansion algorithm
- line-placing algorithm
- line-probe algorithm
- logical algorithm
- mathematically based algorithm
- mathematically intensive algorithm
- maximum matching algorithm
- mesh algorithm - minimum path-length algorithm
- modeling algorithm
- multikey algorithm
- multipass algorithm
- nested algorithm
- network algorithm
- normal algorithm
- no-wait algorithm
- operative algorithm
- optimal assignment algorithm
- optimal cutting algorithm
- ordering algorithm
- page-replacement algorithm
- paging algorithm
- parallel algorithm
- partitioning algorithm
- path-tracing algorithm
- pipeline algorithm
- pitch algorithm
- placement algorithm
- prediction algorithm
- primal-dual algorithm
- primary algorithm
- problem algorithm
- procrastination algorithm
- public-key algorithm
- quorum-based algorithm
- random search algorithm
- recognition algorithm
- recursive algorithm
- relaxation algorithm
- replicate algorithm
- robust algorithm
- round-robin algorithm
- routing algorithm
- scanline algorithm
- scheduling algorithm
- sequential algorithm
- shortest path algorithm
- shrinking algorithm
- simplex algorithm
- simulated annealing algorithm
- software algorithm
- spanning tree algorithm
- speech generation algorithm
- speed-enhancing algorithm
- square rooting algorithm
- steepest ascent algorithm
- systolic algorithm
- testing algorithm
- text-to-speech algorithm
- threshold decoding algorithm
- timetable scheduling algorithm
- trace back algorithm
- translation algorithm
- transportation algorithm
- tree-search algorithm
- two-dimensional placement algorithm
- two-list algorithm
- type-inferencing algorithm
- unconstrained minimization algorithm
- universal algorithm
- variable-stealing algorithm
- Vintr algorithm
- VLSI algorithm
- write-back algorithmEnglish-Russian dictionary of computer science and programming > algorithm
-
9 flow-synthesic algorithm
-
10 flow-synthesis algorithm
алгоритм составления структурной схемы
—
[Л.Г.Суменко. Англо-русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.]Тематики
EN
Англо-русский словарь нормативно-технической терминологии > flow-synthesis algorithm
-
11 flow-synthesic algorithm
Большой англо-русский и русско-английский словарь > flow-synthesic algorithm
-
12 flow augmenting algorithm
Математика: алгоритм поиска увеличивающей поток цепиУниверсальный англо-русский словарь > flow augmenting algorithm
-
13 flow-synthesis algorithm
1) Вычислительная техника: алгоритм составления блок-схемы программы2) Космонавтика: алгоритм составления блок-схем, алгоритм составления программУниверсальный англо-русский словарь > flow-synthesis algorithm
-
14 flow-synthesis algorithm
English-Russian dictionary of computer science and programming > flow-synthesis algorithm
-
15 flow augmenting algorithm
English-Russian scientific dictionary > flow augmenting algorithm
-
16 flow-synthesis algorithm
English-Russian information technology > flow-synthesis algorithm
-
17 genetic algorithm
= GAкласс эвристических алгоритмов оптимизации и поиска, базирующийся на принципах генетики и естественного отбора (natural selection), разновидность эволюционных вычислений (evolutionary computation). Суть GA заключается в перемешивании (рекомбинации, recombination) наиболее перспективных ("выживших") вариантов решений из некоторого первоначального случайного набора вариантов. При этом получается следующее поколение вариантов. Периодически для моделирования мутаций (mutation) в наборы случайным образом вносятся изменения, например производится "скрещивание" (crossover) вариантов. Многократное повторение этого процесса в сочетании с процессом отбора (selection) лучших вариантов рассматривается как имитация процесса эволюции, что в ряде случаев позволяет найти эффективное решение задачи. Теоретические основы GA разработал Джон Холланд (John Holland) в 1975 г.Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > genetic algorithm
-
18 gene flow
1) генетический дрейф, дрейф генов; перенос геновв генетическом программировании - введение в популяцию новой генетической информации путём добавления новых особейSyn:Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > gene flow
-
19 потоковый алгоритм
flow algorithm мат.Русско-английский научно-технический словарь Масловского > потоковый алгоритм
-
20 потоковый алгоритм
Большой англо-русский и русско-английский словарь > потоковый алгоритм
См. также в других словарях:
Push-relabel maximum flow algorithm — The push relabel algorithm is one of the most efficient algorithms to compute a maximum flow. The general algorithm has O(V^2 E) time complexity, while the implementation with FIFO vertex selection rule has O(V^3) running time, the highest active … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… … Wikipedia
Flow network — In graph theory, a flow network is a directed graph where each edge has a capacity and each edge receives a flow. The amount of flow on an edge cannot exceed the capacity of the edge. Often in Operations Research, a directed graph is called a… … Wikipedia
Maximum flow problem — An example of a flow network with a maximum flow. The source is s, and the sink t. The numbers denote flow and capacity. In optimization theory, the maximum flow problem is to find a feasible flow through a single source, single sink flow network … Wikipedia
Optical flow sensor — An optical flow sensor is a vision sensor capable of measuring optical flow or visual motion and outputting a measurement based on optical flow. Various configurations of optical flow sensors exist. One configuration is an image sensor chip… … Wikipedia
Dinic's algorithm — is a strongly polynomial algorithm for computing the maximum flow in a flow network, conceived in 1970 by Israeli (formerly Soviet) computer scientist Yefim Dinitz. The algorithm runs in O(V2E) time and is similar to the Edmonds–Karp algorithm,… … Wikipedia
Ford-Fulkerson algorithm — The Ford Fulkerson algorithm (named for L. R. Ford, Jr. and D. R. Fulkerson) computes the maximum flow in a flow network. It was published in 1956. The name Ford Fulkerson is often also used for the Edmonds Karp algorithm, which is a… … Wikipedia
Edmonds-Karp algorithm — In computer science and graph theory, the Edmonds Karp algorithm is an implementation of the Ford Fulkerson method for computing the maximum flow in a flow network in mathcal{O}(|V| cdot |E|^2). It is asymptotically slower than the relabel to… … Wikipedia
Data-flow analysis — is a technique for gathering information about the possible set of values calculated at various points in a computer program. A program s control flow graph (CFG) is used to determine those parts of a program to which a particular value assigned… … Wikipedia
Paxos algorithm — Paxos is a family of protocols for solving consensus in a network of unreliable processors.Consensus is the process of agreeing on one result among a group of participants. This problem becomes difficult when the participants or their… … Wikipedia